Interactive Object Selection Using S-t Minimum Cut

نویسندگان

  • Ning Xu
  • Narendra Ahuja
چکیده

In this paper, we present an interactive object selection approach that applies s − t minimum cut on local contour neighborhoods of the object boundary to segment the object from the background. Using a simple interface, users can extract accurate object contours interactively. Our approach has the following properties. 1) Interactivity: The interface is easy to use and accepts flexible freehand inputs. Realtime feedback is provided for user interactive correction. 2) Robustness: The s − t minimum cut is insensitive to image noise since it finds the global minimum within the local contour neighborhood. Further, the approach is valid for contours and objects defined by different features, e.g., color and texture. 3) Controllability: Object contours are fully controllable through interactive correction by the user. Experimental results for a wide range of objects are provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive part selection for mesh and point models using hierarchical graph-cut partitioning

INTERACTIVE PART SELECTION FOR MESH AND POINT MODELS USING HIERARCHICAL GRAPH-CUT PARTITIONING Steven W. Brown Department of Computer Science Master of Science This thesis presents a method for interactive part selection for mesh and point set surface models that combines scribble-based selection methods with hierarchically accelerated graph-cut segmentation. Using graph-cut segmentation to det...

متن کامل

Object Boundary Segmentation Using Graph Cuts Based Active Contours

In this paper we propose an iterative graph cuts based active contours approach to segment an object boundary out of background. Given an initial boundary nearby the object, the graph cuts based active contour can iteratively deform to the object boundary even if there are large discontinuities and noise. In each iteration, the area of interest is a certain neighborhood of the previously estima...

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

Interactive Organ Segmentation Using Graph Cuts

An N-dimensional image is divided into “object” and “background” segments using a graph cut approach. A graph is formed by connecting all pairs of neighboring image pixels (voxels) by weighted edges. Certain pixels (voxels) have to be a priori identified as object or background seeds providing necessary clues about the image content. Our objective is to find the cheapest way to cut the edges in...

متن کامل

Object Detection with Saliency Space for Low Depth of Field Images Using Graph Cut Method

The graph cut based approach has become very popular for interactive segmentation of the object -of-interest from the background. Content-based multimedia application plays an important role on automatic segmentation of images with low depth of field (DOF).Graph cut method, separate the important objects (i.e. interest regions) of a given image from its defocused background using novel cluster ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003